Towards Generalized Optimal Cache Proxy Placement

نویسندگان

  • Shu Zhou
  • Min-You Wu
  • Wei Shu
چکیده

A study on cache proxy placement for tree-based topology is presented in this paper. Web caching has been developed maturely to deal with burst increasing network traffic. Most existing works on web caching focus on contentbased issue. Some of the newly published papers discussed the placement of caches and presented algorithms to find out the optimal solution. However, they all assume constant hit ratio, which is for mirroring proxies. In this paper, we investigate the optimal placement of cache proxies, based on a dynamic hit ratio model. We propose a refined greedy algorithms to solve this problem. Intensive simulations have been conducted to evaluate performance of the proposed algorithms and compare it with constant hit ratio scenario.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Packet-Level Simulation Study of Optimal Web Proxy Cache Placement

The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response time for retrieving Web objects. Approaches to this problem in the literature include graph theoretic approaches, combinatorial approaches, dynamic programming approaches, and vector quantization approaches. In this pap...

متن کامل

Dynamic Cache Reconfiguration Strategies for a Cluster-based Streaming Proxy

The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The problem is further complicated by the fact that video popularity changes over time. In this paper, we study caching issues for a cluster-based streaming proxy in the face of changing video popularity. We show that the cac...

متن کامل

Optimal and Near Optimal Web Proxy Placement Algorithms for Networks with Planar Graph Topologies

This paper investigates the placement of a finite set of web cache proxies in a computer network with a planar graph topology, based on a dynamic programming approach. Three criteria are defined for the web proxy placement: 1) the min-sum strategy with consolidated request forwarding (MS-CRF); 2) the min-sum criterion with immediate request forwarding (MS-IRF); and 3) the minmax with immediate ...

متن کامل

Cache Design for Transcoding Proxy Caching

As audio and video applications have proliferated on the Internet, transcoding proxy caching is attracting an increasing amount of attention, especially in the environment of mobile appliances. Since cache replacement and consistency algorithms are two factors that play a central role in the functionality of transcoding proxy caching, it is of particular practical necessity to involve them into...

متن کامل

Power Aware Hybrid Proxy Cache-Prefetch Model using Combined Energy Conservation Policies

The World Wide Web (WWW) is growing exponentially in terms of number of users and number of Web applications. Due to enormous traffic in the network and several factors like bandwidth availability, request processing time at server, round trip time and object size, the Web latency is increasing. The sophisticated integration of Web prefetching and caching deployed at proxy server with Web log m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003